Bit-Pattern Based Integral Attack

نویسندگان

  • Muhammad Reza Z'aba
  • Håvard Raddum
  • Matt Henricksen
  • Ed Dawson
چکیده

Integral attacks are well-known to be effective against bytebased block ciphers. In this document, we outline how to launch integral attacks against bit-based block ciphers. This new type of integral attack traces the propagation of the plaintext structure at bit-level by incorporating bit-pattern based notations. The new notation gives the attacker more details about the properties of a structure of cipher blocks. The main difference from ordinary integral attacks is that we look at the pattern the bits in a specific position in the cipher block has through the structure. The bit-pattern based integral attack is applied to Noekeon, Serpent and present reduced up to 5, 6 and 7 rounds, respectively. This includes the first attacks on Noekeon and present using integral cryptanalysis. All attacks manage to recover the full subkey of the final round.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attack on Six Rounds of Crypton

In this paper we present an attack on a reduced round version of Crypton. The attack is based on the dedicated Square attack. We explain why the attack also works on Crypton and prove that the entire 256-bit user key for 6 rounds of Crypton can be recovered with a complexity of 2 encryptions, whereas for Square 2 encryptions are required to recover the 128-bit user key.

متن کامل

Improved Integral Attacks on MISTY1

We present several integral attacks on MISTY1 using the FO Relation, which is derived from Sakurai-Zheng Property used in previous attacks. The FO Relation is a more precise form of the Sakurai-Zheng Property such that the functions in the FO Relation depend on 16-bit inputs instead of 32-bit inputs used in previous attacks, and that the functions do not change for different keys while previous...

متن کامل

Improving Integral Cryptanalysis against Rijndael with Large Blocks

This report presents new four-round integral properties against the Rijndael cipher with block sizes larger than 128 bits. Using higher-order multiset distinguishers and other well-known extensions of those properties, the deduced attacks reach up to 7 and 8 rounds of Rijndael variants with 160 up to 256-bit blocks. For example, a 7-rounds attack against Rijndael-224 has a time complexity equal...

متن کامل

Attacking Seven Rounds of Rijndael under 192-bit and 256-bit Keys

The authors of Rijndael [3] describe the \Square attack" as the best known attack against the block cipher Rijndael. If the key size is 128 bit, the attack is faster than exhaustive search for up to six rounds. We extend the Square attack on Rijndael variants with larger keys of 192 bit and 256 bit. Our attacks exploit minor weaknesses of the Rijndael key schedule and are faster than exhaustive...

متن کامل

Semi Random Position Based Steganography for Resisting Statistical Steganalysis

Steganography is the branch of information hiding for secret communication. The simplest and widely used steganography is the LSB based approach due to its visual quality with high embedding capacity. However, LSB based steganography techniques are not secure against statistical steganalysis mainly χ2 attack and Regular Singular (RS) attack. These two staganalysis can easily estimate the hidden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008